Implied Costs in Wireless Networks

| We calculate implied costs for wireless networks and use them for evaluating trade-oos between calls of diierent rates. We model user mobility by assigning probabilities for the departure of calls. We use Fixed Channel Assignment (FCA) with priority for handoos over new call arrivals by reserving a number of channels for handoo calls in all the cells. The performance measures used are new call blocking and handoo drop probabilities. The implied cost is calculated for the network net revenue which considers the revenue generated by accepting a new call arrival into the network as well as the cost of a handoo drop in any cell. Simulation and numerical results are presented as well as conndence intervals showing the accuracy of the model. The implied costs also show that matching capacity distribution to not only exoge-nous traac but also to mobility can signiicantly increase network revenue and quantiies this increase. I. Introduction Recently, demand for wireless services has increased reeect-ing a need for person-to-person communication, which in turn brings new issues to consider such as mobility management for the service providers, 1]. One of those issues is the treatment of handoos where, because of a user's mobility, the call has to be handed oo from one base station to another. If the new base station does not have a channel available, the handoo call will be blocked. Typically, on account of customer indignation , the rejection of a handoo is considered to be more detrimental than the rejection of new incoming calls. Thus, the handoo blocking probability is an important criterion for the performance of wireless networks. Essentially, admission of handoos is done using one of three criteria. The rst method is to consider handoos and new call arrivals equally for occupancy of the channels, the second reserves channels in each cell to give priority to handoos and the third sends handoos to a queue if no channel is available. Several performance evaluation algorithms have been introduced for these handoo strategies such as 3] for the reservation strategy and the queueing strategy and in 7] for the reservation and no reservation strategy. In this paper we model a network where users are allowed to move to adjacent cells with certain probability once their call is in progress and we use a model with reservation to give priority to handoo calls versus new calls. In general, the analysis techniques used for …